On the Complexity of finding Stopping Distance in Tanner Graphs
نویسندگان
چکیده
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence.
منابع مشابه
On the Complexity of Finding Stopping Distance in Tanner Graphs
— The problem of finding the stopping distance of the Tanner graph for a linear block code is shown to be NP-Hard.
متن کاملFinding Small Stopping Sets in the Tanner Graphs of LDPC Codes
The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...
متن کاملLower Bounds on Stopping Distance of Linear Codes and Their Applications
One of the most important open problems in the communication society is to determine the performance of iterative message passing algorithms over loopy graphs. Some recent work addresses this problem for loopy Tanner graphs by introducing the concepts of stopping distance and stopping redundancy. By analyzing the eigenvalues and eigenvectors of the normalized incidence matrix representing a Tan...
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملINSTITUTE “ Synchronization in Low Duty Cycle UWB Systems Using Iterative
Iterative message passing algorithms (MPAs) on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near optimal performance and significant complexity reduction. The goal of the first part of this work is to apply message passing techniques to the pseudo random code acquisition problems. To do that, g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0512101 شماره
صفحات -
تاریخ انتشار 2005